Pemuisi: a constraint satisfaction-based generator of topical Indonesian poetry
نویسندگان
چکیده
Pemuisi is a poetry generation system that generates topical poems in Indonesian using a constraint satisfaction approach. It scans popular news websites for articles and extracts relevant keywords that are combined with various language resources such as templates and other slot fillers into lines of poetry. It then composes poems from these lines by satisfying a set of given constraints. A Turing Test-style evaluation and a detailed evaluation of three different configurations of the system was conducted through an online questionnaire with 180 respondents. The results showed that under the best scenario, 57% of the respondents thought that the generated poems were authored by humans, and that poems generated using the full set of constraints consistently measured better on all aspects than those generated using the other two configurations. The system is now available online as a web application.
منابع مشابه
Automatically Generating Rhythmic Verse with Neural Networks
We propose two novel methodologies for the automatic generation of rhythmic poetry in a variety of forms. The first approach uses a neural language model trained on a phonetic encoding to learn an implicit representation of both the form and content of English poetry. This model can effectively learn common poetic devices such as rhyme, rhythm and alliteration. The second approach considers poe...
متن کاملGenerator and Search Objects in Java
Generator classes are defined in the object oriented programming language Java by using continuation-style programming. Generator objects are used to write Prolog-like programs in Java to solve combinatorial constraint satisfaction problems. A collection of generators oriented to world wide web applications is demonstrated on searches for HTML pages.
متن کاملComparing evolutionary algorithms on binary constraint satisfaction problems
Constraint handling is not straightforward in evolutionary algorithms (ea) since the usual search operators, mutation and recombination, are ‘blind’ to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade numerous eas for solving constraint satisfaction problems (csp) have been introduced and studied on various problems...
متن کاملOn the Minimal Constraint Satisfaction Problem: Complexity and Generation
The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by d ≥ 9. Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly,...
متن کاملHarnessing Constraint Programming for Poetry Composition
Constraints are a major factor shaping the conceptual space of many areas of creativity. We propose to use constraint programming techniques and off-the-shelf constraint solvers in the creative task of poetry writing. We show how many aspects essential in different poetical forms, and partially even in the level of language syntax and semantics can be represented as interacting constraints. The...
متن کامل